package recursion.leetcode.medium;

/**
 * @author bruin_du
 * @description 求1+2+…+n
 * @date 2022/6/1 9:18
 **/
public class Offer64_SumNums {
    public int sumNums(int n) {
        boolean x = n > 1 && (n += sumNums(n - 1)) > 0;
        return n;
    }
}
